A Fair Scheduling for Wireless Mesh Networks

نویسندگان

  • Naouel Ben Salem
  • Jean-Pierre Hubaux
چکیده

Wireless Mesh Networks (WMNs) represent a new and promising paradigm that uses multi-hop communications to extend WiFi networks: By deploying only one hot spot (directly connected to the Internet) and several transient access points (TAPs), an Internet Service Provider (ISP) can extend its coverage and serve a large number of clients using a single broadband connection. Unfortunately, if the medium access protocol is poorly designed or inadequate, it can lead to severe unfairness and low bandwidth utilization. In this paper, we propose a fair scheduling mechanism that optimizes the bandwidth utilization in the mesh network. Our solution assigns transmission rights to the links in the WMN and maximizes the spatial reuse (i.e., the possibility for links that do not contend to be activated at the same time). We show that our solution is fair and collision-free, and we evaluate its efficiency by means of simulations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fair Scheduling using Spectrum Load Smoothing Algorithm for Mesh Networks

Fair distributed scheduling is always a big challenge issue in wireless mesh networks. In this work we focus on the IEEE 802.11s proposal by the Mesh Network Alliance (MNA) which aims to enhance the legacy 802.11 medium access protocol to enable efficient mesh operation. We propose an Enhanced Distributed Reservation Protocol (EDRP) to achieve fair scheduling in wireless mesh networks. Our prot...

متن کامل

Fair Scheduling and Throughput Maximization for IEEE 802.16 Mesh Mode Broadband Wireless Access Networks

Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the ...

متن کامل

Novel Techniques for Fair Rate Control in Wireless Mesh Networks

IEEE 802.11 based wireless mesh networks can exhibit severe fairness problem by distributing throughput among different flows originated from different nodes. Congestion control, Throughput, Fairness are the important factors to be considered in any wireless network. Flows originating from nodes that directly communicate with the gateway get higher throughput. On the other hand, flows originati...

متن کامل

Misbehavior Resistant Fair Scheduling in Wireless Backhaul Mesh Networks

IYER, VARAGUR K. Misbehavior Resistant Fair Scheduling in Wireless Backhaul Mesh Networks. (Under the direction of Dr. Peng Ning). Wireless Mesh Networks (WMNs) are increasingly becoming popular as a means to realizing cost-effective and efficient public area networks. WMNs provide improved coverage with relatively cheaper infrastructure and are easy to deploy and expand as compared to Wireless...

متن کامل

Destination-oriented Routing and Maximum Capacity Scheduling Algorithms in Cayley Graph Model for Wireless Mesh Network

Routing and scheduling act important roles in improving capacity and throughput in wireless mesh networks. In this paper, Cayley graph model is suggested for wireless Mesh Networks (WMN) with MIMO channels for efficient routing and fair scheduling. The model is based on the multiple interfaces, directional antennas, single channel mesh model. And the link edges or active edges can be viewed as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005